Ordinal Optimization and Quantification of Heuristic Designs
نویسندگان
چکیده
This paper focuses on the performance evaluation of complex man-made systems, such as assembly lines, electric power grid, traffic systems, and various paper processing bureaucracies, etc. For such problems, applying the traditional optimization tool of mathematical programming and gradient descent procedures of continuous variables optimization are often inappropriate or infeasible, as the design variables are usually discrete and the accurate evaluation of the system performance via a simulation model can take too much calculation. General search type and heuristic methods are the only two methods to tackle the problems. However, the “goodness” of heuristic methods is generally difficult to quantify while search methods often involve extensive evaluation of systems at many design choices in a large search space using a simulation model resulting in an infeasible computation burden. The purpose of this paper is to address these difficulties simultaneously by extending the recently developed methodology of Ordinal Optimization (OO). Uniform samples are taken out from the whole search space and evaluated with a crude but computationally easy model when applying OO. And, we argue, after ordering via the crude performance estimates, that the lined-up uniform samples can be seen as an approximate ruler. By comparing the heuristic design with such a ruler, This work was supported by NSFC Grant (60574067, 60704008, 60721003 and 60736027), the NCET (No. NCET-04-0094) program of China, the 111 International Collaboration Project of China and the high-level graduate student scholarship 2007 of China Scholarship Council. Z. Shen (B) · Y.-C. Ho · Q.-C. Zhao Center for Intelligent and Networked Systems (CFINS), Department of Automation, TNLIST, Tsinghua University, Beijing 100084, People’s Republic of China e-mail: [email protected] Z. Shen Department of Manufacturing Engineering and Center for Information and Systems Engineering, Boston University, Brookline, MA 02446, USA Y.-C. Ho School of Engineering and Applied Sciences, Harvard University, Cambridge, USA Discrete Event Dyn Syst we can quantify the heuristic design, just as we measure the length of an object with a ruler. In a previous paper we showed how to quantify a heuristic design for a special case but we did not have the OO ruler idea at that time. In this paper we propose the OO ruler idea and extend the quantifying method to the general case and the multiple independent results case. Experimental results of applying the ruler are also given to illustrate the utility of this approach.
منابع مشابه
Ordinal comparison of heuristic algorithms using stochastic optimization
The performance of heuristic algorithms for combinatorial optimization is often sensitive to problem instances. In extreme cases, a specialized heuristic algorithm may perform exceptionally well on a particular set of instances while fail to produce acceptable solutions on others. Such a problem-sensitive nature is most evident in algorithms for combinatorial optimization problems such as job s...
متن کاملOrdinal optimization of DEDS
In this paper we argue that ordinal rather than cardinal optimization, i.e., concentrating on finding good, better, or best designs rather than on estimating accurately the performance value of these designs, offers a new, efficient, and complementary approach to the performance optimization of systems. Some experimental and analytical evidence is offered to substantiate this claim. The main pu...
متن کاملImproving the Ordinal Inconsistency of Pairwise Comparison Matrices
This paper investigates the effects of non-transitive judgments on the consistency of pairwise comparison matrices and proposes a heuristic algorithm for identifying and eliminating their ordinal inconsistencies. The algorithm is based on graphical representation of the comparison matrices and identifies the edges in the digraph, which are mostly responsible for three-way cycles, representing t...
متن کاملA Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution
In this paper, a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...
متن کاملA Hybrid Heuristic Optimization Approach for Leak Detection in Pipe Networks Using Ordinal Optimization Approach and the Symbiotic Organism Search
A new transient-based hybrid heuristic approach is developed to optimize a transient generation process and to detect leaks in pipe networks. The approach couples the ordinal optimization approach (OOA) and the symbiotic organism search (SOS) to solve the optimization problem by means of iterations. A pipe network analysis model (PNSOS) is first used to determine steady-state head distribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Event Dynamic Systems
دوره 19 شماره
صفحات -
تاریخ انتشار 2009